(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

from(X) → cons(X, n__from(s(X)))
first(0, Z) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
sel(0, cons(X, Z)) → X
sel(s(X), cons(Y, Z)) → sel(X, activate(Z))
from(X) → n__from(X)
first(X1, X2) → n__first(X1, X2)
activate(n__from(X)) → from(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

Rewrite Strategy: INNERMOST

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
sel(s(X), cons(Y, Z)) →+ sel(X, Z)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [X / s(X), Z / cons(Y, Z)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)